package com.da.javatest.niuke.baodian;

/**
 * @author chenlida
 * @date 2020/10/12 19:17
 * https://www.nowcoder.com/practice/434922f9f4724b97b83c417e884008f1?tpId=8&tags=&title=&diffculty=0&judgeStatus=0&rp=1
 */
public class C65Factor {
    public static int getFactorSuffixZero(int n) {
        int count = 0;
        for (int i = 5; i <= n; i++) {
            int k = i;
            while (k % 5 == 0) {
                k = k / 5;
                count++;
            }
        }
        return count;
    }

    public static void main(String[] args) {
        System.out.println(getFactorSuffixZero(100));
    }
}
